Tikhonov Regularization with a Solution Constraint
نویسندگان
چکیده
منابع مشابه
Tikhonov Regularization with a Solution Constraint
Many numerical methods for the solution of linear ill-posed problems apply Tikhonov regularization. This paper presents a modification of a numerical method proposed by Golub and von Matt for quadratically constrained least-squares problems and applies it to Tikhonov regularization of large-scale linear discrete ill-posed problems. The method is based on partial Lanczos bidiagonalization and Ga...
متن کاملTikhonov Regularization
An important issue in quantitative nance is model calibration. The calibration problem is the inverse of the pricing problem. Instead of computing prices in a model with given values for its parameters, one wishes to compute the values of the model parameters that are consistent with observed prices. Now, it is well-known by physicists that such inverse problems are typically ill-posed. So, if ...
متن کاملA Regularization Parameter for Nonsmooth Tikhonov Regularization
In this paper we develop a novel criterion for choosing regularization parameters for nonsmooth Tikhonov functionals. The proposed criterion is solely based on the value function, and thus applicable to a broad range of functionals. It is analytically compared with the local minimum criterion, and a posteriori error estimates are derived. An efficient numerical algorithm for computing the minim...
متن کاملMulti-Parameter Tikhonov Regularization
We study multi-parameter Tikhonov regularization, i.e., with multiple penalties. Such models are useful when the sought-for solution exhibits several distinct features simultaneously. Two choice rules, i.e., discrepancy principle and balancing principle, are studied for choosing an appropriate (vector-valued) regularization parameter, and some theoretical results are presented. In particular, t...
متن کاملNonstationary Iterated Tikhonov Regularization
A convergence rate is established for nonstationary iterated Tik-honov regularization, applied to ill-posed problems involving closed, densely deened linear operators, under general conditions on the iteration parameters. It is also shown that an order-optimal accuracy is attained when a certain a posteriori stopping rule is used to determine the iteration number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2004
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827502412280